rnnr \ - A * ) 19990719 021 Indexing Flower

نویسندگان

  • Madirakshi Das
  • R. Manmatha
  • Edward M. Riseman
چکیده

A new approach to indexing a specialized database by utilizing the color and spatial domain knowledge available for the database is described. This approach is illustrated by using it to provide a solution to the problem of indexing images of flowers for searching a flower patents database by color. The flower region is isolated from the background by using an automatic iterative segmentation algorithm with domain knowledge-driven feedback. The color of the flower is defined by the color names present in the flower region and their relative proportions. The database can be queried by example and by color names. The system provides a perceptually correct retrieval with natural language queries by using a natural language color classification derived from the ISCC-NBS color system and the X Window color names. The effectiveness of the strategy on a test database is demonstrated.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Indexing Flower Patent Images Using Domain Knowledge

A new approach to indexing a specialized database by utilizing the color and spatial domain knowledge available for the database is described. This approach is illustrated by using it to provide a solution to the problem of indexing images of flowers for searching a flower patents database by color. The flower region is isolated from the background by using an automatic iterative segmentation a...

متن کامل

Indexing flowers by color names using domain knowledge-driven segmentation

We describe a solution to the problem of indexing images of flowers for searching a flower patents database by color. We use a natural language color classification derived from the ISCC-NBS color system and the X Window color names to effectively use the domain knowledge available, provide perceptually correct retrieval and allow natural language queries. We have developed an automatic iterati...

متن کامل

Hybrid LSH: Faster Near Neighbors Reporting in High-dimensional Space

We study the r-near neighbors reporting problem (rNNR) (or spherical range reporting), i.e., reporting all points in a high-dimensional point set S that lie within a radius r of a given query point. This problem has played building block roles in finding near-duplicate web pages, solving k-diverse near neighbor search and content-based image retrieval problems. Our approach builds upon the loca...

متن کامل

تأملاتی بر نمایه‌ سازی تصاویر: یک تصویر ارزشی برابر با هزار واژه

Purpose: This paper presents various  image indexing techniques and discusses their advantages and limitations.             Methodology: conducting a review of the literature review, it identifies three main image indexing techniques, namely concept-based image indexing, content-based image indexing and folksonomy. It then describes each technique. Findings: Concept-based image indexing is te...

متن کامل

Image Similarity Measurement using Shape Feature

In this paper, we describe an incipient method for image retrieval predicated on the local invariant shape feature, designated scalable shape context. The feature utilizes the Harris-Laplace corner to locat the fix points and coinside scale in the animal and flower image. Then, we utilize shape context to explain the local shape. Correspondence of feature points is achieved by a weighted bipart...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999